Linear Hypergraph Edge Coloring - Generalizations of the EFL Conjecture
نویسندگان
چکیده
منابع مشابه
On the simultaneous edge-coloring conjecture
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous edge-coloring and conjectured that every bipartite graphic sequence, with all degrees at least 2, has a 2-simultaneous edge-colorable realization. In fact, this conjecture is a reformulation of a conjecture of Keedwell (Graph Theory, Combinatorics, Algorithms and Applications, Proceedings...
متن کاملVertex-coloring edge-weightings: Towards the 1-2-3-conjecture
A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such a weighting is possible from the weight set {1, 2, 3, 4, 5} for all graphs not containing components with exactly 2 vertices. All graphs in this note are finite and simple. For notation not defined here we refer the reader to ...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملHardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) 1/10−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22Ω( √ log logN) colors. Their result is obtain...
متن کاملApproximate Hypergraph Coloring
A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic. We are interested in the problem of coloring 2-colorable hypergraphs. For the special case of graphs (hypergraphs of dimension 2) this can easily be done in linear time. The problem for general hypergraphs is much more difficult since a result of Lovász implies that the problem is NP-hard even...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Sciences and Applications
سال: 2016
ISSN: 2278-9634
DOI: 10.18052/www.scipress.com/bmsa.17.1